Hidden Hops Aware Load Balancing Based on Greedy Approach

Virtual network mapping is one of the main problems in network virtualization. At present, virtual networking mapping aims at minimal resource consumption at substrate network, but ignores the resource demanded by the hidden hops, making bottlenecks due to the resource shortage at the hidden hops. This paper aims at the simultaneous loading balance of the substrate node and the substrate link, mathematically formulates the virtual networking mapping problem constrained by hops, and solves it by using greedy algorithm. Our experiments show that this algorithm eliminates resource bottleneck efficiently, provides a more balanced substrate network for the request of the consequential virtual network request, thus improving the constructing success rate of virtual network, the availability of network resources and the profits of the infrastructure providers.